On Strongest Paths, Delta Arcs and Blocks in Fuzzy Graphs
نویسنده
چکیده
In this paper we study strongest paths in a fuzzy graph. A necessary and sufficient condition for an arc in a fuzzy graph to be a strongest path and a sufficient condition for a path in a fuzzy graph to be a strongest path are obtained. A characterization of δ−arcs and the relationship between fuzzy cutnodes and δ−arcs are also obtained. Also a characterization of blocks is obtained using strongest paths.
منابع مشابه
Coverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملON DEGREES OF END NODES AND CUT NODES IN FUZZY GRAPHS
The notion of strong arcs in a fuzzy graph was introduced byBhutani and Rosenfeld in [1] and fuzzy end nodes in the subsequent paper[2] using the concept of strong arcs. In Mordeson and Yao [7], the notion of“degrees” for concepts fuzzified from graph theory were defined and studied.In this note, we discuss degrees for fuzzy end nodes and study further someproperties of fuzzy end nodes and fuzz...
متن کاملMenger's theorem for fuzzy graphs
The concept of the strongest path plays a crucial role in fuzzy graph theory. In classical graph theory, all paths in a graph are strongest, with a strength value of one. In this article, we introduce Menger’s theorem for fuzzy graphs and discuss the concepts of strengthreducing sets and t-connected fuzzy graphs. We also characterize t-connected and t-arc connected fuzzy graphs. 2012 Elsevier I...
متن کاملSome Remarks on Complement of Fuzzy Graphs
Fuzzy Graphs are having numerous applications in problems like Network analysis, Clustering, Pattern Recognition and Neural Networks. The analysis of properties of fuzzy graphs has facilitated the study of many complicated networks like Internet. In this paper we study the structures of complement of many important fuzzy graphs such as Fuzzy cycles, Blocks etc. The complement of fuzzy graphs wi...
متن کامل